A Mixed-Integer Linear Programming approach for university timetabling problem with the multi-section courses: an application for Hacettepe University Department of Business Administration

University course timetabling is an NP-Complete problem type which becomes even more difficult due to the specific requirements of each university. In this study, it was aimed solve a university by using integer programming and develop assignment models that can be easily adapted similar problems. The we developed for solution are based on model Daskalaki et al. [1]. addition, were taking into account fact there availability multi-section courses, minimum overlap elective ability divide courses sessions in terms effective use capacity. framework, two different (model 1 2) developed. Whereas assumes all processed as single session (If has 3 time periods per week, then taught session), 2 assigned divided multiple 1+1+1 or 2+1 sessions.). 2, structure itself could determine how split framework predetermined options Both formulated such way maximize satisfaction lecturers. Finally, larger scale derived from first performance these compared both results showed optimal obtained within specified constraints, significantly increased with increase size problem.